Transforming Cycle Rewriting into String Rewriting (Extended Version)
نویسندگان
چکیده
We present new techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and then apply state of the art techniques to prove termination of the string rewrite system. We present three such transformations, and prove for all of them that they are sound and complete. Apart from this transformational approach, we extend the use of matrix interpretations as was studied before. We present several experiments showing that often our new techniques succeed where earlier techniques fail. 1998 ACM Subject Classification F.4.2 Grammars and other rewriting systems
منابع مشابه
Transforming Cycle Rewriting into String Rewriting
We present new techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and then apply state of the art techniques to prove termination of the string rewrite system. We present three such transformations, and prove for all of them t...
متن کاملTermination of Cycle Rewriting
String rewriting can not only be applied on strings, but also on cycles and even on general graphs. In this paper we investigate termination of string rewriting applied on cycles, shortly denoted as cycle rewriting, which is a strictly stronger requirement than termination on strings. Most techniques for proving termination of string rewriting fail for proving termination of cycle rewriting, bu...
متن کاملTermination of Cycle Rewriting by Transformation and Matrix Interpretation
We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and then apply state of the art techniques to prove termination of the string rewrite system. We present three such transformations, and prove for all of them that ...
متن کاملTranslating Logic Programs into Conditional Rewriting Systems
In this paper a translation from a subclass of logic programs consisting of the simply moded logic programs into rewriting systems is deened. In these rewriting systems conditions and explicit substitutions may be present. We argue that our translation is more natural than previously studied ones and establish a result showing its correctness. programming: transforming logic programs to lazy fu...
متن کاملTransforming Linear Context-Free Rewriting Systems into Minimalist Grammars
The type of a minimalist grammar (MG) as introduced by Stabler [11, 12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB–theory to minimalism. Michaelis [6] has shown that MGs constitute a subclass of mildly context–sensitive grammars in the sense that for each MG there...
متن کامل